Zero-Free Intervals of Chromatic Polynomials of Mixed Hypergraphs
نویسندگان
چکیده
A mixed hypergraph H is a triple (X,C,D), where X finite set and each of C D family subsets X. For any positive integer ?, proper ?-coloring an assignment ? colors to vertices in such that member contains at least two assigned the same color different colors. The chromatic polynomial graph-function counting number distinct ?-colorings whenever integer. In this article, we show polynomials hypergraphs under certain conditions are zero-free intervals (??,0) (0,1), which extends known results on graphs hypergraphs.
منابع مشابه
Chromatic polynomials of some sunflower mixed hypergraphs
The theory of mixed hypergraph coloring was first introduced by Voloshin in 1993 and has been growing ever since. The proper coloring of a mixed hypergraph H = (X, C,D) is the coloring of the vertex set X so that no D-hyperedge is monochromatic and no C-hyperedge is polychromatic. A mixed hypergraph with hyperedges of type D, C or B is commonly known as a D, C, or B-hypergraph respectively wher...
متن کاملChromatic polynomials of some mixed hypergraphs
Motivated by a recent result of Walter [Electron. J. Combin. 16 (2009), R94] concerning the chromatic polynomials of some hypergraphs, we present the chromatic polynomials of several (non-uniform) mixed hypergraphs. We use a recursive process for generating explicit formulae for linear mixed hypercacti and multi-bridge mixed hypergraphs using a decomposition of the underlying hypergraph into bl...
متن کاملChromatic polynomials of hypergraphs
In this paper we present some hypergraphs which are chromatically characterized by their chromatic polynomials. It occurs that these hypergraphs are chromatically unique. Moreover we give some equalities for the chromatic polynomials of hypergraphs generalizing known results for graphs and hypergraphs of Read and Dohmen.
متن کاملOn zero-free intervals of flow polynomials
Article history: Received 10 January 2011 Available online 20 November 2014
متن کاملA zero-free interval for chromatic polynomials
Woodall, D.R., A zero-free interval for chromatic polynomials, Discrete Mathematics 101 (1992) 333-341. It is proved that, for a wide class of near-triangulations of the plane, the chromatic polynomial has no zeros between 2 and 2.5. Together with a previously known result, this shows that the zero of the chromatic polynomial of the octahedron at 2.546602. . . is the smallest non-integer real z...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10020193